منابع مشابه
Generalized resolution search
Difficult discrete optimization problems are often solved using a Branch and Bound approach. Resolution search is an alternate approach proposed by Chvátal for 0-1 problems, allowing more flexibility in the search process. In this paper, we generalize the Resolution Search to any discrete problem.
متن کاملTemporal Resolution: A Breadth-First Search Approach
An approach to applying clausal resolution, a proof method for classical logics suited to mechanisation, to temporal logics has been developed by Fisher. The method involves translation to a normal form, classical style resolution within states and temporal resolution between states. The method consists of only one temporal resolution rule and is therefore particularly suitable as the basis of ...
متن کاملEmploying the resolution power of search keys
Search key resolution power is analyzed in the context of a request, i.e., among the set of search keys for the request. Methods of characterizing the resolution power of keys automatically are studied and the effects search keys of varying resolution power have on retrieval effectiveness are analyzed. It is shown that it often is possible to identify the best key of a query while the discrimin...
متن کاملHigh resolution search for dark-matter axions
In the current concordance cosmology, 23% of the universe’s total energy density is contributed by exotic dark matter [1]. The axion, arising from the Peccei-Quinn solution to the strong CP problem [2], satisfies the two criteria necessary for cold dark matter [3]: (1) a very cold population of axions could be present in our universe in sufficient quantities to provide the required dark matter ...
متن کاملImplementing Associative Search and Responder Resolution
In a paper presented last year at WMPP’01 [Walker01], we described the initial prototype of an associative processor implemented using field-programmable logic devices (FPLDs). That paper presented an overview of the design, and concentrated on the processor’s instruction set and its implementation using FPLDs. This paper describes the implementation of the processor’s associative operation — a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(96)00003-0